A bovine lymphosarcoma cell line infected with theileria annulata exhibits an irreversible reconfiguration of host cell gene expression

Theileria annulata, an intracellular parasite of bovine lymphoid cells, induces substantial phenotypic alterations to its host cell including continuous proliferation, cytoskeletal changes and resistance to apoptosis. While parasite induced modulation of host cell signal transduction pathways and NFκB activation are established, there remains considerable speculation on the complexities of the parasite directed control mechanisms that govern these radical changes to the host cell. Our objectives in this study were to provide a comprehensive analysis of the global changes to host cell gene expression with emphasis on those that result from direct intervention by the parasite. By using comparative microarray analysis of an uninfected bovine cell line and its Theileria infected counterpart, in conjunction with use of the specific parasitacidal agent, buparvaquone, we have identified a large number of host cell gene expression changes that result from parasite infection. Our results indicate that the viable parasite can irreversibly modify the transformed phenotype of a bovine cell line. Fifty percent of genes with altered expression failed to show a reversible response to parasite death, a possible contributing factor to initiation of host cell apoptosis. The genes that did show an early predicted response to loss of parasite viability highlighted a sub-group of genes that are likely to be under direct control by parasite infection. Network and pathway analysis demonstrated that this sub-group is significantly enriched for genes involved in regulation of chromatin modification and gene expression. The results provide evidence that the Theileria parasite has the regulatory capacity to generate widespread change to host cell gene expression in a complex and largely irreversible manner

ProKinO: An Ontology for Integrative Analysis of Protein Kinases in Cancer

Protein kinases are a large and diverse family of enzymes that are genomically altered in many human cancers. Targeted cancer genome sequencing efforts have unveiled the mutational profiles of protein kinase genes from many different cancer types. While mutational data on protein kinases is currently catalogued in various databases, integration of mutation data with other forms of data on protein kinases such as sequence, structure, function and pathway is necessary to identify and characterize key cancer causing mutations. Integrative analysis of protein kinase data, however, is a challenge because of the disparate nature of protein kinase data sources and data formats., where the mutations are spread over 82 distinct kinases. We also provide examples of how ontology-based data analysis can be used to generate testable hypotheses regarding cancer mutations.

Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability

<p>Abstract</p> <p>Background</p> <p>In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accuracy of a phylogeny reconstruction method is measured by simulations on synthetic datasets with known "true" phylogenies, while little theoretical analysis has been done. In this paper, we present a new model-based approach to measuring the accuracy of a quartet-based phylogeny reconstruction method. Under this model, we propose three efficient algorithms to reconstruct the "true" phylogeny with a high success probability.</p> <p>Results</p> <p>The first algorithm can reconstruct the "true" phylogeny from the input quartet topology set without quartet errors in <it>O</it>(<it>n</it>²) time by querying at most (<it>n </it>- 4) log(<it>n </it>- 1) quartet topologies, where <it>n </it>is the number of the taxa. When the input quartet topology set contains errors, the second algorithm can reconstruct the "true" phylogeny with a probability approximately 1 - <it>p </it>in <it>O</it>(<it>n</it>⁴log <it>n</it>) time, where <it>p </it>is the probability for a quartet topology being an error. This probability is improved by the third algorithm to approximately <inline-formula><m:math name="1748-7188-3-1-i1" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mrow><m:mfrac><m:mn>1</m:mn><m:mrow><m:mn>1</m:mn><m:mo>+</m:mo><m:msup><m:mi>q</m:mi><m:mn>2</m:mn></m:msup><m:mo>+</m:mo><m:mfrac><m:mn>1</m:mn><m:mn>2</m:mn></m:mfrac><m:msup><m:mi>q</m:mi><m:mn>4</m:mn></m:msup><m:mo>+</m:mo><m:mfrac><m:mn>1</m:mn><m:mrow><m:mn>16</m:mn></m:mrow></m:mfrac><m:msup><m:mi>q</m:mi><m:mn>5</m:mn></m:msup></m:mrow></m:mfrac></m:mrow><m:annotation encoding="MathType-MTEF"> MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaqcfa4aaSaaaeaacqaIXaqmaeaacqaIXaqmcqGHRaWkcqWGXbqCdaahaaqabeaacqaIYaGmaaGaey4kaSYaaSaaaeaacqaIXaqmaeaacqaIYaGmaaGaemyCae3aaWbaaeqabaGaeGinaqdaaiabgUcaRmaalaaabaGaeGymaedabaGaeGymaeJaeGOnaydaaiabdghaXnaaCaaabeqaaiabiwda1aaaaaaaaa@3D5A@</m:annotation></m:semantics></m:math></inline-formula>, where <inline-formula><m:math name="1748-7188-3-1-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:semantics><m:mrow><m:mi>q</m:mi><m:mo>=</m:mo><m:mfrac><m:mi>p</m:mi><m:mrow><m:mn>1</m:mn><m:mo>−</m:mo><m:mi>p</m:mi></m:mrow></m:mfrac></m:mrow><m:annotation encoding="MathType-MTEF"> MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaGaemyCaeNaeyypa0tcfa4aaSaaaeaacqWGWbaCaeaacqaIXaqmcqGHsislcqWGWbaCaaaaaa@3391@</m:annotation></m:semantics></m:math></inline-formula>, with running time of <it>O</it>(<it>n</it>⁵), which is at least 0.984 when <it>p </it>< 0.05.</p> <p>Conclusion</p> <p>The three proposed algorithms are mathematically guaranteed to reconstruct the "true" phylogeny with a high success probability. The experimental results showed that the third algorithm produced phylogenies with a higher probability than its aforementioned theoretical lower bound and outperformed some existing phylogeny reconstruction methods in both speed and accuracy.</p

Abrasion resistance and compressive strength of unprocessed rice husk ash concrete

This paper investigates the effects of adding natural rice husk ash collected from uncontrolled burning and without previous grinding (NRHA) as cement replacement in concrete. To obtain an adequate particle size, NRHA was mixed with coarse aggregate for a convenient period of time before adding the other components. Compressive strength, water absorption, porosity, and abrasion resistance expressed as weight loss were examined. Test results show that decreasing the particle size through mixing with coarse aggregate improved the compressive strength, reduced the permeability, and increased the abrasion resistance of concrete. By mixing NRHA with aggregate for 8 min, abrasion resistance improved by 10.35 and 23.62% over the control concrete at 28 and 91 days, respectively. Incorporating NRHA in concrete by grinding with coarse aggregate during the mixing process could be suitable for making normal-strength concrete and for applications where abrasion resistance is an important parameter. In addition, using NRHA as a partial replacement cement contributes to the reduction of CO2 emissions due to the production of cement

Some fixed point theorems for generalized contractive mappings in complete metric spaces

We introduce new concepts of generalized contractive and generalized alpha-Suzuki type contractive mappings. Then, we obtain sufficient conditions for the existence of a fixed point of these classes of mappings on complete metric spaces and b-complete b-metric spaces. Our results extend the theorems of Ciric, Chatterjea, Kannan and Reich

Mutations in the Catalytic Loop HRD Motif Alter the Activity and Function of Drosophila Src64

The catalytic loop HRD motif is found in most protein kinases and these amino acids are predicted to perform functions in catalysis, transition to, and stabilization of the active conformation of the kinase domain. We have identified mutations in a Drosophila src gene, src64, that alter the three HRD amino acids. We have analyzed the mutants for both biochemical activity and biological function during development. Mutation of the aspartate to asparagine eliminates biological function in cytoskeletal processes and severely reduces fertility, supporting the amino acid's critical role in enzymatic activity. The arginine to cysteine mutation has little to no effect on kinase activity or cytoskeletal reorganization, suggesting that the HRD arginine may not be critical for coordinating phosphotyrosine in the active conformation. The histidine to leucine mutant retains some kinase activity and biological function, suggesting that this amino acid may have a biochemical function in the active kinase that is independent of its side chain hydrogen bonding interactions in the active site. We also describe the phenotypic effects of other mutations in the SH2 and tyrosine kinase domains of src64, and we compare them to the phenotypic effects of the src64 null allele